On the covering radius of some modular codes
نویسندگان
چکیده
This paper gives lower and upper bounds on the covering radius of codes over Z2s with respect to homogenous distance. We also determine the covering radius of various Repetition codes, Simplex codes (Type α and Type β) and their dual and give bounds on the covering radii for MacDonald codes of both types over Z4.
منابع مشابه
On the parameters of codes for the Lee and modular distance
Sol&, P., On the parameters of codes for the Lee and modular distance, Discrete Mathematics 89 (1991) 185-194. We introduce the concept of a weakly metric association scheme, a generalization of metric schemes. We undertake a combinatorial study of the parameters of codes in these schemes, along the lines of [9]. Applications are codes over 2, for the Lee distance and arithmetic codes for the m...
متن کاملOn the covering radius of some binary cyclic codes
We compute the covering radius of some families of binary cyclic codes. In particular, we compute the covering radius of cyclic codes with two zeros and minimum distance greater than 3. We compute the covering radius of some binary primitive BCH codes over F2f , where f = 7, 8.
متن کاملMulti-Covering Radius for Rank Metric Codes
The results of this paper are concerned with the multi-covering radius, a generalization of covering radius, of Rank Distance (RD) codes. This leads to greater understanding of RD codes and their distance properties. Results on multi-covering radii of RD codes under various constructions are given by varying the parameters. Some bounds are established. A relationship between multi-covering radi...
متن کاملCovering radius construction codes with minimum distance at most 8 are normal
In this paper we introduce the class of covering radius (CR)-codes as a generalization of greedy codes. First we show how a CR−code is constructed and introduce some basic terminology. Some properties which are satisfied by these codes are then discussed. We review the property of normality for codes and show that CR−codes with minimum distance at most 8 are normal.
متن کاملNew Quaternary Linear Codes with Covering Radius 21
A new quaternary linear code of length 19, codimension 5, and covering radius 2 is found in a computer search using tabu search, a local search heuristic. Starting from this code, which has some useful partitioning properties, di!erent lengthening constructions are applied to get an in"nite family of new, record-breaking quaternary codes of covering radius 2 and odd codimension. An algebraic co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Adv. in Math. of Comm.
دوره 8 شماره
صفحات -
تاریخ انتشار 2014